Search results for "Collaborative Filtering"
showing 10 items of 18 documents
LeSSS: Learned Shared Semantic Spaces for Relating Multi-Modal Representations of 3D Shapes
2015
In this paper, we propose a new method for structuring multi-modal representations of shapes according to semantic relations. We learn a metric that links semantically similar objects represented in different modalities. First, 3D-shapes are associated with textual labels by learning how textual attributes are related to the observed geometry. Correlations between similar labels are captured by simultaneously embedding labels and shape descriptors into a common latent space in which an inner product corresponds to similarity. The mapping is learned robustly by optimizing a rank-based loss function under a sparseness prior for the spectrum of the matrix of all classifiers. Second, we extend …
Comparing ranking-based collaborative filtering algorithms to a rating-based alternative in recommender systems context
2017
Suuri sisältövalikoima eri internet palveluissa, kuten verkkokaupoissa, voi aiheuttaa liian suurta informaatiomäärää, mikä heikentää asiakaskokemusta. Suosittelujärjestelmät ovat teknologioita, jotka tukevat asiakkaan päätöksentekoa tarjoamalla ennustettuja suosituksia. On yleistä, että asiakkaalle näytetään lista tuotteista, joista asiakas voisi pitää, esimerkiksi top-10 lista elokuvista. Perinteisesti nämä listat ovat tuotettu käyttäen perinteistä arvosanapohjaista menetelmää, missä tuntemattomille tuotteille ennustetaan arvosana ja järjestetty lista muodostetaan arvosanojen perusteella. Sijoitusperusteinen lähestyminen laskee käyttäjien väliset samankaltaisuudet ja ennustaa järjestetyn l…
Listwise Collaborative Filtering
2015
Recently, ranking-oriented collaborative filtering (CF) algorithms have achieved great success in recommender systems. They obtained state-of-the-art performances by estimating a preference ranking of items for each user rather than estimating the absolute ratings on unrated items (as conventional rating-oriented CF algorithms do). In this paper, we propose a new ranking-oriented CF algorithm, called ListCF. Following the memory-based CF framework, ListCF directly predicts a total order of items for each user based on similar users' probability distributions over permutations of the items, and thus differs from previous ranking-oriented memory-based CF algorithms that focus on predicting th…
A recommendation system for the prediction of drug-target associations
2022
In this chapter a recommendation system is presented, based on the integration of a Protein-Protein Interaction (PPI) network taken from the Intact database, and a set of associations between drugs and targets taken from the DrugBank database. Depending on how proteins are connected on the PPI network, given an input drug the system suggests new targets. The framework adopted for the implementation is Apache Spark, useful for loading, managing and manipulating data by means of appropriate Resilient Distributed Datasets (RDD), and for the use of the Alternating Least Square (ALS) machine learning algorithm, a Matrix Factorization algorithm for distributed and parallel computing.Finally, an a…
A Pseudo-Supervised Approach to Improve a Recommender Based on Collaborative Filtering
2003
This PhD Thesis develops an optimal recommender. First of all, users accessing to a Web site are clustered. If a user belongs to a cluster, the system offers services which are usually accessed by users from the same cluster in a collaborative filtering scheme. A novel approach based on a users simulator and a dynamic recommendation system is proposed. The simulator is used to create the situations that one can find in a Web site. Introduction of dynamics in the recommender allows to change the clusters and in turn, the decisions which are taken. Since the system is based both on supervised and unsupervised learning whose borders are not too clear in our approach, we talk about a pseudo-sup…
An approach based on the Adaptive Resonance Theory for analysing the viability of recommender systems in a citizen Web portal
2007
This paper proposes a methodology to optimise the future accuracy of a collaborative recommender application in a citizen Web portal. There are four stages namely, user modelling, benchmarking of clustering algorithms, prediction analysis and recommendation. The first stage is to develop analytical models of common characteristics of Web-user data. These artificial data sets are then used to evaluate the performance of clustering algorithms, in particular benchmarking the ART2 neural network with K-means clustering. Afterwards, it is evaluated the predictive accuracy of the clusters applied to a real-world data set derived from access logs to the citizen Web portal Infoville XXI (http://www…
Listwise Recommendation Approach with Non-negative Matrix Factorization
2018
Matrix factorization (MF) is one of the most effective categories of recommendation algorithms, which makes predictions based on the user-item rating matrix. Nowadays many studies reveal that the ultimate goal of recommendations is to predict correct rankings of these unrated items. However, most of the pioneering efforts on ranking-oriented MF predict users’ item ranking based on the original rating matrix, which fails to explicitly present users’ preference ranking on items and thus might result in some accuracy loss. In this paper, we formulate a novel listwise user-ranking probability prediction problem for recommendations, that aims to utilize a user-ranking probability matrix to predi…
Improving Serendipity and Accuracy in Cross-Domain Recommender Systems
2017
Cross-domain recommender systems use information from source domains to improve recommendations in a target domain, where the term domain refers to a set of items that share attributes and/or user ratings. Most works on this topic focus on accuracy but disregard other properties of recommender systems. In this paper, we attempt to improve serendipity and accuracy in the target domain with datasets from source domains. Due to the lack of publicly available datasets, we collect datasets from two domains related to music, involving user ratings and item attributes. We then conduct experiments using collaborative filtering and content-based filtering approaches for the purpose of validation. Ac…
SCCF Parameter and Similarity Measure Optimization and Evaluation
2019
Neighborhood-based Collaborative Filtering (CF) is one of the most successful and widely used recommendation approaches; however, it suffers from major flaws especially under sparse environments. Traditional similarity measures used by neighborhood-based CF to find similar users or items are not suitable in sparse datasets. Sparse Subspace Clustering and common liking rate in CF (SCCF), a recently published research, proposed a tunable similarity measure oriented towards sparse datasets; however, its performance can be maximized and requires further analysis and investigation. In this paper, we propose and evaluate the performance of a new tuning mechanism, using the Mean Absolute Error (MA…
INTACMATO: An IIMT-Prototype
2011
In the previous chapter, we pointed out that although users evaluate IIMT very positively, only a limited number of IIMT are offered. We assume that the main reason for this is that online sellers do not know which IIMT they should offer and what they should exactly look like. We address these two aspects in this chapter. Firstly, we review literature on IDA in the field of human interaction. We discuss several drawbacks of current approaches as well as the resulting requirements for the design of IIMT. Secondly, we break down observed decision-making behavior into typical steps decision makers apply in their decision processes. These steps indicate which IIMT would offer appropriate decisi…